Sample average approximation for risk-averse problems: A virtual power plant scheduling application

نویسندگان

چکیده

In this paper, we address the decision-making problem of a virtual power plant (VPP) involving self-scheduling and market involvement under uncertainty in wind speed electricity prices. The is modeled using risk-neutral two risk-averse two-stage stochastic programming formulations, where conditional value at risk used to represent risk. A sample average approximation methodology integrated with an adapted L-Shaped solution method, which can solve specific problems. This provides framework understand quantify impact size on variability results. numerical results include analysis computational performance for case studies, estimators bounds true optimal solutions problems, assessment quality obtained. particular, experiences indicate that when adequate used, obtained close one.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sample Average Approximation of Risk-averse Stochastic Programs

ACKNOWLEDGEMENTS First of all, I would like to thank my advisor Prof. Shabbir Ahmed for his care and fine guidance through the years. I thank him for introducing me to the fascinating field of stochastic programming. From beginning to end, I find his exuberant creativity and in-depth scholarly knowledge inspiring. I feel fortunate to have such a wonderful mentor who taught me in many aspects: c...

متن کامل

Risk Averse Optimal Operation of a Virtual Power Plant using two Stage Stochastic Programming

Virtual Power Plant (VPP) is defined as a cluster of energy conversion/storage units which are centrally operated in order to improve the technical and economic performance. This paper addresses the optimal operation of a VPP considering the risk factors affecting its daily operation profits. The optimal operation is modelled in both day ahead and balancing markets as a two-stage stochastic mix...

متن کامل

A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure

This paper is concerned with solving single CVaR and mixed CVaR minimization problems. A CHKS-type smoothing sample average approximation (SAA) method is proposed for solving these two problems, which retains the convexity and smoothness of the original problem and is easy to implement. For any fixed smoothing constant 2, this method produces a sequence whose cluster points are weak stationary ...

متن کامل

Sample Average Approximation Method for Compound Stochastic Optimization Problems

The paper studies stochastic optimization (programming) problems with compound functions containing expectations and extreme values of other random functions as arguments. Compound functions arise in various applications. A typical example is a variance function of nonlinear outcomes. Other examples include stochastic minimax problems, econometric models with latent variables, multi-level and m...

متن کامل

Risk averse single machine scheduling - complexity and approximation

In this paper a class of single machine scheduling problems is considered. It is assumed that job processing times and due dates can be uncertain and they are specified in the form of discrete scenario set. A probability distribution in the scenario set is known. In order to choose a schedule some risk criteria such as the value at risk (VaR) an conditional value at risk (CVaR) are used. Variou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EURO journal on computational optimization

سال: 2021

ISSN: ['2192-4406', '2192-4414']

DOI: https://doi.org/10.1016/j.ejco.2021.100005